Derangements and Tensor Powers of Adjoint Modules for <InlineEquation ID="IE1"> <EquationSource Format="MATHTYPE"> <![CDATA[% MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgzgj% xyRrxDYbqeguuDJXwAKbIrYf2A0vNCaGqbaiab-Xc8Zjab-vc8Snaa% BaaaleaacaWGUbaabeaaaaa!45E7!]]> </EquationSource> <EquationSource Format="TEX"> <![CDATA[$$\mathfrak{s}\mathfrak{l}_n $$]]> </EquationSource> </InlineEquation>
نویسنده
چکیده
We obtain the decomposition of the tensor spacesl⊗k n as a module forsln , find an explicit formula for the multiplicities of its irreducible summands, and (when n ≥ 2k) describe the centralizer algebra C = Endsln (sl⊗k n ) and its representations. The multiplicities of the irreducible summands are derangement numbers in several important instances, and the dimension of C is given by the number of derangements of a set of 2k elements.
منابع مشابه
Double Circulant Codes over <InlineEquation ID="IE1"> <EquationSource Format="MATHTYPE"> <![CDATA[% MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOjdaryqr1ngBPrginfgDObcv39gaiuaacqWFKeIwdaWgaaWcbaGa % aGinaaqabaaaaa!419E! ]]> </EquationSource> <EquationSource Format="TEX"> <![CDATA[$$\mathbb{Z}_4 $$]]> </EquationSource> </InlineEquation> and Even Unimodular Lattices
With the help of some new results about weight enumerators of self-dual codes overZ4 we investigate a class of double circulant codes over Z4, one of which leads to an extremal even unimodular 40-dimensional lattice. It is conjectured that there should be “Nine more constructions of the Leech lattice”.
متن کاملEstimating the Minimal Number of Colors in Acyclic <InlineEquation ID="IE1"> <EquationSource Format="MATHTYPE"> <![CDATA[% MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWexLMBb50ujb % qeguuDJXwAKbacfiGae83AaSgaaa!3C30! ]]> </EquationSource> <EquationSource Format="TEX"> <![CDATA[$$k $$]]> </EquationSource> </InlineEquation>-Strong Colorings of Maps on Surfaces
A coloring of the vertices of a graph is called acyclic if the ends of each edge are colored in distinct colors, and there are no two-colored cycles. Suppose each face of rank k , k ≥ 4 , in a map on a surface S is replaced by the clique having the same number of vertices. It is proved in [1] that the resulting pseudograph admits an acyclic coloring with the number of colors depending linearly ...
متن کاملPlethysm and fast matrix multiplication
Motivated by the symmetric version of matrix multiplication we study the plethysm $S^k(\mathfrak{sl}_n)$ of the adjoint representation $\mathfrak{sl}_n$ of the Lie group $SL_n$. In particular, we describe the decomposition of this representation into irreducible components for $k=3$, and find highest weight vectors for all irreducible components. Relations to fast matrix multiplication, in part...
متن کاملThe margination propensity of spherical particles for vascular targeting in the microcirculation
The propensity of circulating particles to drift laterally towards the vessel walls (margination) in the microcirculation has been experimentally studied using a parallel plate flow chamber. Fluorescent polystyrene particles, with a relative density to water of just 50 g/cm3comparable with that of liposomal or polymeric nanoparticles used in drug delivery and bio-imaging, have been used with a ...
متن کاملTestbed for Preparation of A Russian Patent Document in XML Format
An experimental technology for Russian patent document preparation in XML is described. For this purpose the special draft XML PatDoc DTD is used. This technological DTD is the analog of the subset SGML DTD of the World Intellectual Property Organization (WIPO) Standard ST.32. This compound XML document may contain mathematical expressions and chemical formulae which are presented by reference ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002